Chapter 10: Join Methods and Query Optimization
نویسندگان
چکیده
Joins between data sources are an essential ingredient of multidomain queries, as they exploit connection patterns defined between service marts or between service interfaces. This chapter moves from the definition of a query language over service interfaces, sketching how queries can be directly expressed over service marts and how these can be translated over service interfaces. The fundamental operation discussed in this chapter is the binary join between two sources, which is influenced by the type (search vs. exact) of services and by the management (parallel vs. sequential) of service calls. Then, this chapter presents an optimization framework for queries over several service interfaces, which considers several cost metrics for mapping queries into query plans, consisting of specific operations over services, and includes a branch and bound approach to the exploration of the combinatorial search space of all possible query plans.
منابع مشابه
Relational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملDeclarative Query Tuning and Optimization using Answer Set Programming
In [2, Chapter 14], Lewis describes the basics behind the procedure used by the oracle query optimizer for computing the optimal join order for a sample query. Given a set T of n pairs table:cost, a join order is a full binary tree such that (i) T is the set of its leaves, (ii) the right child of an inner node is a leaf, and (iii) each inner node is a pair join tag:cost where join tag is either...
متن کاملUsing Inductive Learning To Generate Rules for Semantic Query Optimization
Semantic query optimization can dramatically speed up database query answering by knowledge intensive reformulation. But the problem of how to learn the required semantic rules has not been previously solved. This chapter presents a learning approach to solving this problem. In our approach, the learning is triggered by user queries. Then the system uses an inductive learning algorithm to gener...
متن کامل17 Using Inductive Learning To Generate Rules for Semantic Query Optimization
Semantic query optimization can dramatically speed up database query answering by knowledge intensive reformulation. But the problem of how to learn the required semantic rules has not been previously solved. This chapter presents a learning approach to solving this problem. In our approach, the learning is triggered by user queries. Then the system uses an inductive learning algorithm to gener...
متن کاملStorage and Query Processing Optimizations for Hierarchically - Organized Data
Hierarchical data can be found anywhere multiple pieces of information are connected by a relationship. The first chapter of my thesis deals with processing relational queries in the context of a native XML storage system. We take advantage of hierarchical XML to equate the nested structure of the XML documents with the key relationship between two data items. A join query can then be rewritten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013